General neighbour-distinguishing index of a graph
نویسندگان
چکیده
منابع مشابه
General neighbour-distinguishing index of a graph
It is proved that edges of a graph G can be coloured using χ(G) + 2 colours so that any two adjacent vertices have distinct sets of colours of their incident edges. In the case of a bipartite graph three colours are sufficient.
متن کاملThe relationship between the distinguishing number and the distinguishing index with detection number of a graph
This article has no abstract.
متن کاملEdge-Distinguishing Index of a Graph
We introduce a concept of edge-distinguishing colourings of graphs. A closed neighbourhood of an edge e ∈ E(G) is a subgraph N [e] induced by the edge e and all the edges adjacent to it. We say that a colouring c : E(G) → C distinguishes two edges e1 and e2 if there does not exist an isomorphism φ of N [e1] onto N [e2] such that φ(e1) = e2, and φ preserves colours of c. An edge-distinguishing i...
متن کاملAshwini Index of a Graph
Motivated by the terminal Wiener index, we define the Ashwini index $mathcal{A}$ of trees as begin{eqnarray*} % nonumber to remove numbering (before each equation) mathcal{A}(T) &=& sumlimits_{1leq i
متن کاملPeripheral Wiener Index of a Graph
The eccentricity of a vertex $v$ is the maximum distance between $v$ and anyother vertex. A vertex with maximum eccentricity is called a peripheral vertex.The peripheral Wiener index $ PW(G)$ of a graph $G$ is defined as the sum ofthe distances between all pairs of peripheral vertices of $G.$ In this paper, weinitiate the study of the peripheral Wiener index and we investigate its basicproperti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.07.046